A Note on high-rate Locally Testable Codes with sublinear query complexity
نویسنده
چکیده
Inspired by recent construction of high-rate locally correctable codes with sublinear query complexity due to Kopparty, Saraf and Yekhanin (2010) we address the similar question for locally testable codes (LTCs). In this note we show a construction of high-rate LTCs with sublinear query complexity. More formally, we show that for every , ρ > 0 there exists a family of LTCs over the binary field with query complexity n and rate at least 1 − ρ. To obtain this construction we use the result of Ben-Sasson and Viderman (2009).
منابع مشابه
Lecture Notes on Locally Testable Codes and Proofs
In terms of property testing, locally testable codes are error correcting codes such that the property of being a codeword can be tested within low query complexity. As for locally testable proofs (PCPs), these can be viewed as massively parametrized properties that are testable within low query complexity such that the parameterized property is non-empty if and only if the corresponding parame...
متن کاملUniversal Locally Testable Codes
We initiate a study of “universal locally testable codes” (universal-LTCs). These codes admit local tests for membership in numerous possible subcodes, allowing for testing properties of the encoded message. More precisely, a universal-LTC C : {0, 1} → {0, 1} for a family of functions F = { fi : {0, 1} → {0, 1} } i∈[M ] is a code such that for every i ∈ [M ] the subcode {C(x) : fi(x) = 1} is lo...
متن کاملHigh-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity
An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or rather far from the code, by reading only a small number of symbols of the string. Locally testable codes (LTCs) are both interesting in their own right, and have important applications in complexity theory. A long line of research tries to determine the best tradeoff ...
متن کاملUniversal Locally Verifiable Codes and 3-Round Interactive Proofs of Proximity for CSP
Universal locally testable codes (universal-LTCs), recently introduced in our companion paper (ECCC, 2017), are codes that admit local tests for membership in numerous subcodes, allowing for testing properties of the encoded message. Unfortunately, universal-LTCs suffer strong limitations, which motivate us to initiate, in this work, the study of the “NP analogue” of these codes, wherein the te...
متن کامل2 2 A pr 2 01 5 High rate locally - correctable and locally - testable codes with sub - polynomial query complexity ∗
In this work, we construct the first locally-correctable codes (LCCs), and locally-testable codes (LTCs) with constant rate, constant relative distance, and sub-polynomial query complexity. Specifically, we show that there exist binary LCCs and LTCs with block length n, constant rate (which can even be taken arbitrarily close to 1), constant relative distance, and query complexity exp(Õ( √ logn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 17 شماره
صفحات -
تاریخ انتشار 2010